منابع مشابه
Exact Wirelength of Embedding the Hypercubes into Cycle-of-ladders
Hypercubes are a very popular model for parallel computation because of their regularity and the relatively small number of interprocessor connections. In this paper, we present an algorithm to compute the exact wirelength of embedding the hypercubes into cycle-of-ladders and prove its correctness.
متن کاملEmbedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
We consider the problem of embedding hypercubes into cylinders to minimize the wirelength. Further we show that the edge isoperimetric problem solves the wirelength problem of regular graphs and in particular hypercubes into triangular snakes and caterpillars.
متن کاملThe vertex monophonic number of a graph
For a connected graph G of order p ≥ 2 and a vertex x of G, a set S ⊆ V (G) is an x-monophonic set of G if each vertex v ∈ V (G) lies on an x− y monophonic path for some element y in S. The minimum cardinality of an x-monophonic set of G is defined as the x-monophonic number of G, denoted by mx(G). An x-monophonic set of cardinality mx(G) is called a mx-set of G. We determine bounds for it and ...
متن کاملThe Connected Monophonic Number of a Graph
For a connected graph G = (V, E), a monophonic set of G is a set M � V (G) such that every vertex of G is contained in a monophonic path joining some pair of vertices in M. The monophonic number m (G) of G is the minimum order of its monophonic sets and any monophonic set of order m (G) is a minimum monophonic set of G. A connected monophonic set of a graph G is a monophonic set M such that the...
متن کاملThe Open Monophonic Number of a Graph
For a connected graph G of order n, a subset S of vertices of G is a monophonic set of G if each vertex v in G lies on a x-y monophonic path for some elements x and y in S. The minimum cardinality of a monophonic set of G is defined as the monophonic number of G, denoted by m(G). A monophonic set of cardinality m(G) is called a m–set of G. A set S of vertices of a connected graph G is an open m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i3.12603